منابع مشابه
WFLP 2007 Declaring Numbers
Most implementations of functional and functional logic languages treat numbers and the basic numeric operations as external entities. The main reason for this is efficiency. However, this basic design decision has many unfortunate consequences for all programs using numbers. We present an approach to model numbers in a declarative way and argue that the loss in efficiency is compensated by the...
متن کاملDeclaring Classes in Pattern Calculus
Pattern calculus is able to represent a fixed system of classes by treating methods as pattern-matching functions, along with a powerful account of both quantified types and of subtypes. This paper adds class, and subclass declarations to support an evolving class hierarchy. Even though method meanings change as new classes are introduced, the properties of existing programs do not change. This...
متن کاملDeclaring Drought for Effective Water Management
Water managers are tasked with resolving conflicts between freshwater resource uses, which range from municipal water supply, to recreation, and to sustaining aquatic ecosystem integrity. Further complicating management, hydrologic processes experience numerous sources of periodic, quasi-periodic, and episodic variation. Water allocation trade offs are often most complex and contentious when av...
متن کاملDeclaring Constraints on Object-oriented Collections
Logic puzzles such as Sudoku are described by a set of properties that a valid solution must have. Constraints are a useful technique to describe and solve for such properties. However, constraints are less suited to express imperative interactions in a user interface for logic puzzles, a domain that is more readily expressed in the objectoriented paradigm. Object constraint programming provide...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemical & Engineering News Archive
سال: 2005
ISSN: 0009-2347,2157-4936
DOI: 10.1021/cen-v083n027.p003